Problem Generators for Rectangular packing problems

نویسندگان

E. Hopper

B. C. H. Turton

چکیده

In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for 2D rectangular and irregular packing has been fairly limited in terms of object size, number and dimension of items. A systematic investigation into the performance of new algorithms requires the use of a range of test problems. As it is tedious and time consuming to construct a large number of packing problems manually, problem generators have been developed allowing the creation test instances. The generators in this work address 2D guillotineable and non-guillotineable strip packing as well as 2D bin packing problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...

متن کامل

روشی جدید برای چیدمان قطعات مستطیل شکل در یک فضای مستطیل شکل

Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fun...

متن کامل

بررسی تعدادی از روشهای آماری جهت ترسیم نمودار کنترل مشاهدات انفرادی برای فرایندهای اتورگرسیو

متن کامل

Two-Dimensional Packing For Irregular Shaped Objects

Packing problems arise in a wide variety of application areas. The basic problem is that of determining an efficient arrangement of different objects in a region without any overlap. The simplest packing problem is rectangular packing, where both the objects and the region are rectangular. Many research works have been done on two and three dimensional rectangular packing. However there are man...

متن کامل